A Control-Theoretical Approach for Fair Share Computation in Core-Stateless Networks
نویسندگان
چکیده
In this paper, we propose the use of a control theoretical approach for a fast and robust fair share computation for a class of fair queueing algorithms based on the Scalable Core (SCORE)/Dynamic Packet State (DPS) architecture. Our proposed approach is generic and can be applied to other SCORE/DPS fair queueing algorithms with little modifications. For purpose of illustration, we applied the Linear Quadratic (LQ) control method from the optimal control theory to our modification of Core-Stateless Fair Queueing (CSFQ). Simulation results show that this approach gives improved flow isolation between TCP and UDP flows when compared with CSFQ.
منابع مشابه
A control-theoretical approach for achieving fair bandwidth allocations in core-stateless networks
In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on the Scalable Core (SCORE) / Dynamic Packet State (DPS) architecture. In particular, we make use of the Linear Quadratic control method from optimal control theory to design stable and robust systems that are simple to implement. Simulation results show that this approach gives ...
متن کاملUN CO RR EC TE D PR OO F 2 A control - theoretical approach for achieving fair bandwidth 3 allocations in core - stateless networks 4
9 In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on 10 the scalable core (SCORE)/dynamic packet state (DPS) architecture. In particular, we make use of the linear quadratic 11 control method from optimal control theory to design stable and robust systems that are simple to implement. Sim12 ulation results show that this approa...
متن کاملCore-Stateless Labeling Fairness: An Integrated Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks
Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require per-packet relabeling in the core routers. In this paper, we propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Fu...
متن کاملAdaptive CSFQ: A New Fair Queuing Mechanism for SCORE Networks
In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...
متن کاملA Novel Modified Secant Method for Computing the Fair Share Rate
In 1 , a framework of core-stateless fair queueing CSFQ , which does not require per flow management or operation at core routers, was proposed. It is able to provide high quality of services while maintaining a high level of robustness, simplicity and scalability. In this framework, one key element is the calculation of the fair share rate, which is briefly reviewed in the next section. The ac...
متن کامل